The Subsumption Problem of the Fuzzy Description Logic ALCFH
نویسندگان
چکیده
We present the fuzzy description logic ALCFH where primitive concepts are modified by means of hedges taken from hedge algebras. ALCFH is strictly more expressive than Fuzzy-ALC defined in [9]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired degree by prefixing them with appropriate chains of hedges. Furthermore, we define a decision procedure for the unsatisfiability problem in ALCFH and for the subsumption problem in a fragment of ALCFH .
منابع مشابه
The Fuzzy Description Logic Alcflh
In this paper, we present the fuzzy description logic ALCFLH . ALCFLH is based on ALCFH , but linear hedges are used instead of exponential ones. This allows to solve the entailment and the subsumption problem in a fuzzy description logic, where arbitrary concepts and roles may be modified.
متن کاملThe Fuzzy Description Logic ALCFH with Hedge Algebras as Concept Modifiers
In this paper we present the fuzzy description logic ALCFH introduced, where primitive concepts are modified by means of hedges taken from hedge algebras. ALCFH is strictly more expressive than Fuzzy-ALC defined in [11]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired degree by prefixing them with appropriate chains of hedges. Furthermore, w...
متن کاملInformatik MCL Master ’ s Thesis on The Subsumption Problem of the Fuzzy Description Logic
Because of the simplicity in the structure of the Description Logic (DL) FL0, it has been commonly taken as the first example for the presentation of new notions and their associated problems [1],[2]. Fuzzy Description Logics extend classical Description Logics by allowing truth degrees to deal with imprecise concepts. In this work we show that in the fuzzy DL FL0 with greatest fixed-point sema...
متن کاملPositive Subsumption in Fuzzy EL with General t-Norms
The Description Logic EL is used to formulate several large biomedical ontologies. Fuzzy extensions of EL can express the vagueness inherent in many biomedical concepts. We study the reasoning problem of deciding positive subsumption in fuzzy EL with semantics based on general t-norms. We show that the complexity of this problem depends on the specific t-norm chosen. More precisely, if the t-no...
متن کاملSome Complexity Results on Fuzzy Description Logics
We present and discuss some novel and somewhat surprising complexity results for a basic but significant fuzzy description logic (DL) which extends the classical ALC language. In particular we show that checking the consistency of a concept or a KB in fuzzy DLs has a complexity which jumps from linear-time to EXPTIME-complete, while the subsumption problem is always (at least) as hard as in cri...
متن کامل